Published in: LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Olaf Beyersdorff, Tim Hoffmann, and Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 271, pp. 2:1-2:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{beyersdorff_et_al:LIPIcs.SAT.2023.2, author = {Beyersdorff, Olaf and Hoffmann, Tim and Spachmann, Luc Nicolas}, title = {{Proof Complexity of Propositional Model Counting}}, booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, pages = {2:1--2:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-286-0}, ISSN = {1868-8969}, year = {2023}, volume = {271}, editor = {Mahajan, Meena and Slivovsky, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.2}, URN = {urn:nbn:de:0030-drops-184647}, doi = {10.4230/LIPIcs.SAT.2023.2}, annote = {Keywords: model counting, #SAT, proof complexity, proof systems, lower bounds} }
Feedback for Dagstuhl Publishing